Loss Queueing Networks with Bursty Arrival Processes and Phase Type Service Times: Approximate Analysis
نویسنده
چکیده
Open queueing networks with bursty arrival processes, phase type service times, and losses are considered. A technique is proposed for the speciication of the models. Using such a speci-cation, a Markov chain can be generated automatically. Furthermore, this description can be used immediately for simulation. An approximate disaggregation{aggregation technique for nite state Markov chains is applied. Thus large models with many states can be solved, so large that the state probabilities could neither be stored nor calculated in any computer. Accurate approximations are obtained with different degrees of accuracy, depending on the investigated computational eeort.
منابع مشابه
Approximate Analysis of Queueing Networks with Markovian Arrival Processes and Phase Type Service Times
Open queueing networks with Markovian arrival processes and phase type service times are considered. A technique is proposed for the speciication of the models. Using such a speciication, a Markov chain can be generated automatically. Furthermore, this description can be used immediately for simulation. An approximate disaggregation{aggregation technique for nite state Markov chains is applied....
متن کاملMulti-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)
In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to...
متن کاملThe MMCPP/GE/c Queue
We obtain the queue length probability distribution at equilibrium for a multi-server, single queue with generalised exponential (GE) service time distribution and a Markov modulated compound Poisson arrival process (MMCPP)—i.e. a Poisson point process with bulk arrivals having geometrically distributed batch size whose parameters are modulated by a Markovian arrival phase process. This arrival...
متن کاملQueueing Analysis of Markov Modulated ON/OFF Arrivals with Geometric Service Times
1. INTRODUCTION There has been extensive work focused on modeling discrete-time queueing systems with correlated arrivals [1], [2], [3], [4]. Specific attention has been drawn to queueing models with application to data switching, where bursty arrival streams represent more accurately real-life network traffic. To that end, the Markov modulated ON-OFF model has been frequently incorporated as a...
متن کاملAnalytic Computation of End-to-end Delays in Queueing Networks with Batch Markovian Arrival Processes and Phase-type Service Times
This paper poposes an analytic approach to compute end-to-end delays in queueing networks composed of BMAP/PH/1 queues. The approximations for the first two moments of the end-to-end delays are based on corresponding moments for the delays at each node in the network. In a traffic-based decomposition of queueing networks, different techniques for the departure process approximation, including t...
متن کامل